On 1-factors and matching extension

A recursive theorem on matching extension

A graph G having a perfect matching (or I-factor) is called n-fextendable if every matching of size n is extended to a I-factor. Further, G is said to be (r : m, n }-extendable if, for every connected subgraph S of order 2r for which G \ V(S) is connected, S is m-extendable and G \ V(S) is nextendable. We prove the following: Let p, r, m, and n be positive integers with p r > nand r > m. Then e...

iranian english learners’ perception and personality: a dual approach to investigating influential factors on willingness to communicate

abstract previous studies on willingness to communicate (wtc) have shown the influence of many individual or situational factors on students’ tendency to engage in classroom communication, in which wtc has been viewed either at the trait-level or situational level. however, due to the complexity of the notion of willingness to communicate, the present study suggests that these two strands are ...

Note on a closure concept and matching extension

Matching Objects Without Language Extension

Pattern matching is a powerful programming concept which has proven its merits in declarative programming. The absence of pattern-matching in object-oriented programming languages is felt especially when tackling source code processing problems. But existing proposals for pattern matching in such languages rely on language extension, which makes their adoption overly intrusive. We propose an ap...

Barycentric extension of generalized matching.

In most studies of choice under concurrent schedules of reinforcement, two physically identical operanda are provided. In the "real world," however, more than two choice alternatives are often available and biases are common. This paper describes a method for studying choices among an indefinite number of alternatives when large biases are present. Twenty rats were rewarded for choosing among f...